Carpool Algorithm Based on Similarity Measure of Partition Trajectory Line
نویسندگان
چکیده
منابع مشابه
Optimizing Carpool Scheduling Algorithm through Partition Merging
The rapidly increasing number of vehicles in roads leads to numerous problems in metropolitan areas. Several researchers show that carpooling can be an efficient solution to relieve the pressures caused by large numbers of cars. Previous research on carpools introduces several additional constraints to simplify the problem, but some of them are unreasonable in reality. In this paper, we focus o...
متن کاملAlgorithm of Ontology Similarity Measure Based on Similarity Kernel Learning
Ontology, as a structured conceptual model of knowledge representation and storage, has widely been used in biomedical and pharmaceutical research. The nature of the ontology application is to get the similarity between ontology vertices, and thus reveal the similarity of their corresponding concepts and intrinsic relationships. The similarity for all pairs of vertices forms a similarity matrix...
متن کاملFuzzy Partition based Similarity Measure for Spectral Clustering
The efficiency of spectral clustering depends heavily on the similarity measure adopted. A widely used similarity measure is the Gaussian kernel function where Euclidean distance is used. Unfortunately, the result of spectral clustering is very sensitive to the scaling parameter and the Euclidean distance is usually not suitable to the complex distribution data. In this paper, a spectral cluste...
متن کاملAlgorithm for Semantic Based Similarity Measure
In a document representation model the Semanti based Similarity Measure (SBSM), is proposed. This model combines phrases analysis as well as words analysis with the use of propbank notation as background knowledge to explore better ways of documents representation for clustering. The SBSM assigns semantic weights to both document words and phrases. The new weights reflect the semantic relatedne...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Materials Science and Engineering
سال: 2017
ISSN: 2572-889X
DOI: 10.12783/dtmse/icmsea/mce2017/10795